Optimal shattering of complex networks
نویسندگان
چکیده
منابع مشابه
Optimal synchronization of complex networks.
We study optimal synchronization in networks of heterogeneous phase oscillators. Our main result is the derivation of a synchrony alignment function that encodes the interplay between network structure and oscillators' frequencies and that can be readily optimized. We highlight its utility in two general problems: constrained frequency allocation and network design. In general, we find that syn...
متن کاملOptimal immunisation of complex networks
Complex networks such as the sexual partnership web or the Internet often show a high degree of redundancy and heterogeneity in their connectivity properties. This peculiar connectivity, however, provides an ideal environment for the spreading of biological or digital infective agents. Here we show that the random uniform immunisation of individuals does not lead to the eradication of infection...
متن کاملOptimal navigation in complex networks.
Recent literature has presented evidence that the study of navigation in complex networks is useful to understand their dynamics and topology. Two main approaches are usually considered: navigation of random walkers and navigation of directed walkers. Unlike these approaches ours supposes that a traveler walks optimally in order to minimize the cost of the walking. If this happens, two extreme ...
متن کاملShattering and Compressing Networks for Centrality Analysis
Who is more important in a network? Who controls the flow between the nodes or whose contribution is significant for connections? Centrality metrics play an important role while answering these questions. The betweenness metric is useful for network analysis and implemented in various tools. Since it is one of the most computationally expensive kernels in graph mining, several techniques have b...
متن کاملOptimal routing on complex networks
We present a novel heuristic algorithm for routing optimization on complex networks. Previously proposed routing optimization algorithms aim at avoiding or reducing link overload. Our algorithm balances traffic on a network by minimizing the maximum node betweenness with as little path lengthening as possible, thus being useful in cases when networks are jamming due to queuing overload. By usin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Network Science
سال: 2019
ISSN: 2364-8228
DOI: 10.1007/s41109-019-0205-5